Distributed Relation Logic

Distributed Contingency Logic and Security

In information security, ignorance is not bliss. It is always stated that hiding the protocols (let the other be ignorant about it) does not increase the security of organizations. However, there are cases that ignorance creates protocols. In this paper, we propose distributed contingency logic, a proper extension of contingency (ignorance) logic. Intuitively, a formula is distributed contingen...

Distributed States Temporal Logic

We introduce a temporal logic to reason on global applications in an asynchronous setting. First, we define the Distributed States Logic (DSL), a modal logic for localities that embeds the local theories of each component into a theory of the distributed states of the system. We provide the logic with a sound and complete axiomatization. The contribution is that it is possible to reason about p...

Distributed First Order Logic

Distributed First Order Logic (DFOL) is a formalism introduced more than 10 years ago with the purpose of formalising distributed knowledge-based systems. In these systems, knowledge is scattered in a set of heterogeneous and interconnected modules. The original version of DFOL defined a set of primitives for the specification of a restricted subset of interconnections between knowledge modules...

Distributed Logic Programming

Relevant logic and relation algebras

In 2007, Maddux observed (see [7]) that relevant logics have a natural interpretation in the language of relation algebras, with respect to which certain standard relevant logics are sound. He asked whether this interpretation was complete as well. In 2008, Mikulás proved in [10] that the relevant logic R was not complete with respect to square-increasing, commutative, representable relation al...